|
The Wiener–Araya graph is, in graph theory, a graph on 42 vertices with 67 edges. It is hypohamiltonian, which means that it does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from it is Hamiltonian. It is also planar. ==History== Hypohamiltonian graphs were first studied by Sousselier in ''Problèmes plaisants et délectables'' (1963). In 1967, Lindgren builds an infinite sequence of hypohamiltonian graphs. He first cites Gaudin, Herz and Rossi, then Busacker and Saaty as pioneers on this topic. From the start, the smallest hypohamiltonian graph is known: the Petersen graph. However, the hunt for the smallest planar hypohamiltonian graph continues. This question was first raised by Václav Chvátal in 1973. The answer is provided in 1976 by Carsten Thomassen, who exhibits a 105-vertices construction, the 105-Thomassen graph. In 1979, Hatzel improves this result with a planar hypohamiltonian graph on 57 vertices : the Hatzel graph. This bound is lowered in 2007 by the 48-Zamfirescu graph. In 2009, a graph built by Gábor Wiener and Makoto Araya becomes (with its 42 vertices) the smallest planar hypohamiltonian graph known.〔.〕〔.〕 In their paper, Wiener and Araya conjecture that their graph's is optimal arguing that its order (42) appears to be the answer to The Ultimate Question of Life, the Universe, and Everything from the The Hitchhiker's Guide to the Galaxy, a Douglas Adams novel. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Wiener–Araya graph」の詳細全文を読む スポンサード リンク
|